Counterexamples to Segal's Measure Representation Theorem
نویسنده
چکیده
This article discusses relations between several notions of continuity in rank-dependent utility, and in the generalized version of rank-dependent utility as initiated by Segal. Primarily, examples are given to show logical independencies between these notions of continuity. This also leads to counterexamples to Segal's (1989) characterizing theorem 1.
منابع مشابه
Frobenius kernel and Wedderburn's little theorem
We give a new proof of the well known Wedderburn's little theorem (1905) that a finite division ring is commutative. We apply the concept of Frobenius kernel in Frobenius representation theorem in finite group theory to build a proof.
متن کاملThe Remak-Krull-Schmidt Theorem on\ Fuzzy Groups
In this paper we study a representation of a fuzzy subgroup $mu$ of a group $G$, as a product of indecomposable fuzzy subgroups called the components of $mu$. This representation is unique up to the number of components and their isomorphic copies. In the crisp group theory, this is a well-known Theorem attributed to Remak, Krull, and Schmidt. We consider the lattice of fuzzy subgroups and som...
متن کاملON FELBIN’S-TYPE FUZZY NORMED LINEAR SPACES AND FUZZY BOUNDED OPERATORS
In this note, we aim to present some properties of the space of all weakly fuzzy bounded linear operators, with the Bag and Samanta’s operator norm on Felbin’s-type fuzzy normed spaces. In particular, the completeness of this space is studied. By some counterexamples, it is shown that the inverse mapping theorem and the Banach-Steinhaus’s theorem, are not valid for this fuzzy setting. Also...
متن کاملUnmixed $r$-partite graphs
Unmixed bipartite graphs have been characterized by Ravindra and Villarreal independently. Our aim in this paper is to characterize unmixed $r$-partite graphs under a certain condition, which is a generalization of Villarreal's theorem on bipartite graphs. Also, we give some examples and counterexamples in relevance to this subject.
متن کاملAn elementary proof of the reconstruction conjecture
The reconstruction conjecture states that the multiset of vertex-deleted subgraphs of a graph determines the graph, provided it has at least 3 vertices. This problem was independently introduced by Stanis law Ulam (1960) and Paul Kelly (1957). In this paper, we prove the conjecture by elementary methods. It is only necessary to integrate the Lenkle potential of the Broglington manifold over the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992